Two-player quantum games: When player strategies are via directional choices

نویسندگان

چکیده

Abstract We propose a scheme for quantum game based on performing an EPR-type experiment and in which each player’s spatial directional choices are considered as their strategies. A classical mixed-strategy is recovered by restricting the players’ to specific trajectories. show that Bell-CHSH inequality violated, payoffs have no mapping within game. The provides more direct link between games.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games

Consider the following probabilistic one-player game: The board is a graph with n vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at random from all non-edges and is presented to the player, henceforth called Painter. Painter must assign one of r available colors to each edge immediately, where r ≥ 2 is a fixed integer. The game is over as soon as a mono...

متن کامل

Additional Winning Strategies in Two-Player Games

We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.

متن کامل

Walrasian analysis via two-player games

We associate to any pure exchange economy a game with only two players, regardless of the number of consumers. In this twoplayer game, each player represents a different role of the society, formed by all the individuals in the economy. Player 1 selects feasible allocations trying to make Pareto improvements. Player 2 chooses an alternative from the wider range of allocations that are feasible ...

متن کامل

Two-player entangled games are NP-hard

We show that the maximum success probability of players sharing quantum entanglement in a twoplayer game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant factors. As a corollary, the inclusion NEXP ⊆ MIP∗, first shown in [IV12] with three provers, holds with two provers only. The proof is based on a simpler, imp...

متن کامل

Player Modeling, Search Algorithms and Strategies in Multi-player Games

For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions like Deep Blue vs. Kasparov, and of the beauty of parlor games like Checkers, Backgammon, Othello and Go. Multi-player games, however, have been inspected by far less, and although literature of game theory f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2022

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-022-03526-5